Multi-server verifiable delegation of computations: Unconditional security and practical efficiency

نویسندگان

چکیده

Outsourcing computation has gained significant popularity in recent years due to the prevalence of cloud computing. There are two main security concerns outsourcing computation: how guarantee server performs correctly and keep client's data secret. The single-server verifiable (SSVC) Gennaro, Gentry Parno (Crypto'10) enables a client delegate function f on any input x with both highly relieved, but only results computationally secure schemes that lack practical efficiency. While SSVC use single server, this paper we develop multi-server (MSVC) model where shares among multiple servers, each set computations its shares, finally reconstructs f(x) from all servers' results. In MSVC propose generic construction for form Fx, F is matrix vector. Our achieves information-theoretic security, privacy privacy. By optimizing parameters, obtain 3-server scheme, which uses least number 4-server incurs workload. decomposing many polynomial as two-stage computation, first-stage Fx second-stage fast, delegating these polynomials. We implement our show they most ones date.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toward Practical and Unconditional Verification of Remote Computations

This paper revisits a classic question: how can a machine specify a computation to another one and then, without executing the computation, check that the other machine carried it out correctly? The applications of such a primitive include cloud computing (a computationally limited device offloads processing to the cloud [11] but does not assume the cloud’s correctness [12]); volunteer computin...

متن کامل

Verifiable Delegation of Polynomials

Verifiable computation allows a computationally weak client to outsource evaluation of a function on many inputs to a powerful but untrusted server. The client invests a large amount of off-line computation in an amortized manner to obtain an encoding of its function which is then given to the server. The server returns both the evaluation result of the function on the client’s input and a proo...

متن کامل

A practical verifiable multi-secret sharing scheme

C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed an efficient multi-secret sharing scheme based on a two-variable one-way function in 2004. But the scheme doesn't have the property of verification. A practical verifiable multi-secret sharing scheme, which is based on ...

متن کامل

recognition of the border between delegation and unconditional guardianship

belief in the lofty positions and excellences of the shi’īte imams (a.s.) and having faith in their miraculous acts and dominion over the world affairs underlies the authentic doctrine of unconditional guardianship (wilāya al-takwīnī). when the imams’ devotees try to maintain a demigod status for the imams in line with this – possibly loving and devotional – belief beyond the conventional limit...

متن کامل

Relativistic verifiable delegation of quantum computation

The importance of being able to verify quantum computation delegated to remote servers increases with recent development of quantum technologies. In some of the proposed protocols for this task, a client delegates her quantum computation to non-communicating servers. The fact that the servers do not communicate is not physically justified and it is essential for the proof of security of such pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information & Computation

سال: 2021

ISSN: ['0890-5401', '1090-2651']

DOI: https://doi.org/10.1016/j.ic.2021.104740